On well quasi-order of graph classes under homomorphic image orderings
نویسندگان
چکیده
منابع مشابه
Well-Quasi-Orderings on Binary Trees
We provide a set of “natural” requirements for quasi-orderings of finite and infinite binary trees. We show that any ordering satisfying these requirements must be well-ordered and that there is a unique minimal such ordering. The checker has to verify that the process comes to an end. Here again he should be assisted by the programmer giving a further definite assertion to be verified. This ma...
متن کامل! 2 -well Quasi-orderings in Reachability Analysis
The usefulness of well quasi-orderings for some aspects of veriication of innnite-state systems was already recognized by some researchers. This note shows that a ner notion, namely that of ! 2-well quasi-ordering, is the appropriate one for enlightening a particular problem related to termination of a reachabil-ity algorithm; the problem has already been touched on by Abdulla, Jonsson (1998). ...
متن کاملGap Embedding for Well - Quasi - Orderings 1
Given a quasi-ordering of labels, a labelled ordered tree s is embedded with gaps in another tree t if there is an injection from the nodes of s into those of t that maps each edge in s to a unique disjoint path in t with greater-or-equivalent labels, and which preserves the order of children. We show that finite trees are well-quasiordered with respect to gap embedding when labels are taken fr...
متن کاملVertex elimination orderings for hereditary graph classes
We provide a general method to prove the existence and compute efficiently elimination orderings in graphs. Our method relies on several tools that were known before, but that were not put together so far: the algorithm LexBFS due to Rose, Tarjan and Lueker, one of its properties discovered by Berry and Bordat, and a local decomposition property of graphs discovered by Maffray, Trotignon and Vu...
متن کاملMonadic second-order definable graph orderings
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of monadic second-order logic: one where we can only quantify over sets of vertices and one where we can also quantify over sets of edges. For several special cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2017
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2017.03.008